Deciding Universality of ptNFAs is PSpace-Complete
نویسندگان
چکیده
An automaton is partially ordered if the only cycles in its transition diagram are self-loops. We study the universality problem for ptNFAs, a class of partially ordered NFAs recognizing piecewise testable languages. The universality problem asks if an automaton accepts all words over its alphabet. Deciding universality for both NFAs and partially ordered NFAs is PSpace-complete. For ptNFAs, the complexity drops to coNP-complete if the alphabet is fixed but is open if the alphabet may grow. We show, using a novel and nontrivial construction, that the problem is PSpace-complete if the alphabet may grow polynomially.
منابع مشابه
Verifying Interacting Finite State Machines : Complexity
In this report we carry out a computational complexity analysis of a simple model of concurrency consisting of interacting nite state machines with fairness constraints (IFSMs). This model is based on spec-iication languages used for system speciication by actual formal verii-cation tools, and it allows compact representation of complex systems. We categorize the complexity of two problems aris...
متن کاملComplexity of Universality and Related Problems for Partially Ordered NFAs
Partially ordered nondeterministic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it accepts all words over its input alphabet. Deciding universality is PSpace-complete for poNFAs, and we show that this remains true even when restricting to a ...
متن کاملOn the Complexity of Universality for Partially Ordered NFAs
Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, i.e., for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it accepts all words over its input alphabet. Deciding universality is PSpace-complete for poNFAs, and we show that this remains true even when restricting to a fix...
متن کاملUniversality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard
An automaton is partially ordered if the only cycles in its transition diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can be characterized by the Straubing-Thérien hierarchy. Level 3/2 is recognized by poNFAs, level 1 by confluent, self-loop deterministic poNFAs as well as by confluent poDFAs, and level 1/2 by saturated poNFAs. We study the universality problem for ...
متن کاملWhat's Decidable about Weighted Automata?
Weighted automata map input words to numerical values. Applications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. In the 90’s, Krob studied the decidability of problems on rational series, which strongly relate to weighted automata. In particular, it follows from Krob’s results that the universality problem (that is, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018